The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
نویسنده
چکیده
We review the concept of the number wall as an alternative to the traditional linear complexity profile (LCP), and sketch the relationship to other topics such as linear feedback shift-register (LFSR) and context-free Lindenmayer (D0L) sequences. A remarkable ternary analogue of the Thue-Morse sequence is introduced having deficiency 2 modulo 3, and this property verified via the re-interpretation of the number wall as an aperiodic plane tiling.
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملAutomata on the plane vs particles and collisions
In this note, colorings of the plane by finite sequential machines are compared to previously introduced notions of ultimately periodic tilings of the plane. Finite automata with no counter characterize exactly biperiodic tilings. Finite automata with one counter characterize exactly particles — periodic colorings that are ultimately periodic in every direction. Finite automata with two counter...
متن کاملFixed-point tile sets and their applicationsI
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many fields, ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene’s fixed-point construction instead of geometric arguments. This const...
متن کاملPrediction with Restricted Resources and Finite Automata
We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state automata with a specified number, m, of states to the set of all binary sequences...
متن کاملP - Recursive Integer Sequences and Automata Theory
of the Dissertation P-Recursive Integer Sequences and Automata Theory by Scott Michael Garrabrant Doctor of Philosophy in Mathematics University of California, Los Angeles, 2015 Professor Igor Pak, Chair An integer sequence {an} is called polynomially recursive, or P-recursive, if it satisfies a nontrivial linear recurrence relation of the form q0(n)an + q1(n)an−1 + . . . + qk(n)an−k = 0 , for ...
متن کامل